Response to S. H. Gellman, T. S. Haque, and L. F. Newcomb

T L  C S C F-  

A: Well, yes, Yuri asked me if I wanted to write a logic column, and suggested to talk to you for some inspiration. Q: Sure, we can talk. Do you already have an idea what you will write about? A: I was thinking, perhaps I could write about first-order topological properties. Q: I suppose that is first-order as in " first-order logic " , but what's about the topol-ogy? I'm afraid I do not know m...

T L  C S C F     

A new simple construction of an aperiodic tile set based on self-referential (fixed point) argument is proposed. People often say about some discovery that it appeared “ahead of time”, meaning that it could be fully understood only in the context of ideas developed later. For the topic of this note, the construction of an aperiodic tile set based on the fixed-point (self-referential) approach, ...

Newcomb ’ s Problem

Newcomb’s problem is a decision puzzle whose difficulty and interest stem from the fact that the possible outcomes are probabilistically dependent on, yet causally independent of, the agent’s options. The problem is named for its inventor, the physicist William Newcomb, but first appeared in print in a 1969 paper by Robert Nozick [12]. Closely related to, though less well-known than, the Prison...

T L  C S C T F  O U L: E F P L  L D

A natural liberalization of Datalog is used in the Distributed Knowledge Authorization Language (DKAL). We show that the expressive power of this liberal Datalog is that of existential fixed-point logic. The exposition is self-contained.

Newcomb ' s Problem